On stable and strategy-proof rules in matching markets with contracts
نویسندگان
چکیده
This paper studies stable and (one-sided) strategy-proof matching rules in manyto-onematchingmarkets with contracts. First, the number of such rules is shown to be at most one. Second, the doctor-optimal stable rule, whenever it exists, is shown to be the unique candidate for a stable and strategy-proof rule. Third, a stable and strategyproof rule, when exists, is shown to be second-best optimal for doctor welfare, in the sense that no individually-rational and strategy-proof rule can dominate it. This last result is further generalized to non-wasteful and strategy-proof rules. Notably, all those results are established without any substitutes conditions on hospitals’ choice functions, and hence, the proofs do not rely on the “rural hospital” theorem. We also show by example that the outcomes of a stable and strategy-proof rule do not always coincide with those of the cumulative offer process; hence, the above results hold not because the cumulative offer process is the only candidate for stable and strategyproof rules.
منابع مشابه
The blocking lemma and group incentive compatibility for matching with contracts
This paper considers a general class of two-sided many-to-one matching markets, so-called matching markets with contracts. We study the blocking lemma and group incentive compatibility for this class of matching markets. We first show that the blocking lemma for matching with contracts holds if hospitals’ choice functions satisfy substitutes and the law of aggregate demand. The blocking lemma f...
متن کاملStable matching mechanisms are not obviously strategy-proof
Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a growing amount of empirical evidence reveals that applicants misrepresent their preferences when this mechanism is used. This paper shows that no mechanism th...
متن کاملContract Design and Stability in Matching Markets
We develop a model of many-to-many matching with contracts which subsumes as special cases many-to-many matching markets and buyer-seller markets with heterogeneous and indivisible goods. In our setting, in contrast to results for the setting of many-to-one matching with contracts, preference substitutability is sufficient and necessary to guarantee the existence of a nonempty lattice of stable...
متن کاملGroup incentive compatibility for matching with contracts
Hatfield and Milgrom (2005) present a unified model of matching with contracts, which includes the standard two-sided matching and some package auction models as special cases. They show that the doctor-optimal stable mechanism is strategy-proof for doctors if hospitals’ preferences satisfy substitutes and the law of aggregate demand. We show that the doctor-optimal stable mechanism is group st...
متن کاملStrategy-Proofness for Hospitals in Matching Markets
Strategy-proof implementation is one of the many elements that have contributed to the successful application of matching theory in real life. However, in many-to-one matching markets without transfers (e.g., doctors to hospitals with fixed salaries) there is no stable mechanism which is strategy-proof for hospitals. Furthermore, strategy-proofness and stability cannot be achieved for both hosp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Economic Theory
دوره 168 شماره
صفحات -
تاریخ انتشار 2017